منابع مشابه
Random Walks and Bisections in Random Circulant Graphs
Abstract. Using number theoretical tools, we prove two main results for random r-regular circulant graphs with n vertices, when n is sufficiently large and r is fixed. First, for any fixed ε > 0, prime n and L ≥ n(log n), walks of length at most L terminate at every vertex with asymptotically the same probability. Second, for any n, there is a polynomial time algorithm to find a vertex bisector...
متن کاملApproximating Layout Problems on Random Geometric Graphs
In this paper, we study the approximability of several layout problems on a family of random geometric graphs. Vertices of random geometric graphs are randomly distributed on the unit square and are connected by edges whenever they are closer than some given parameter. The layout problems that we consider are: Bandwidth, Minimum Linear Arrangement, Minimum Cut Width, Minimum Sum Cut, Vertex Sep...
متن کاملApproximating layout problems on random graphs
We show that, with overwhelming probability, several well known layout problems are approximable within a constant for random graphs drawn from the G(n, pn) model where C/n ≤ pn ≤ 1 for all n big enough and for some properly characterized parameter C > 1. In fact, our results establish that, with overwhelming probability, the cost of any arbitrary layout of such a random graph is within a const...
متن کاملGossiping in circulant graphs Gossiping in circulant graphs
ENG) We investigate the gossiping problem, in which nodes of an intercommunication network share information initially given to each one of them according to a communication protocol by rounds. We consider two types of communication protocols: vertex-disjoint path mode, and edge-disjoint path mode. We give a general lower bound on the complexity of gossiping algorithms in terms of the isoperime...
متن کاملImproved approximation of layout problems on random graphs
Inspired by previous work of Diaz, Petit, Serna, and Trevisan (Approximating layout problems on random graphs Discrete Mathematics, 235, 2001, 245–253), we show that several well-known graph layout problems are approximable to within a factor arbitrarily close to 1 of the optimal with high probability for random graphs drawn from an ErdösRenyi distribution with appropriate sparsity conditions. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2018
ISSN: 0024-3795
DOI: 10.1016/j.laa.2018.09.003